Boolean satisfiability problem

Results: 324



#Item
191Electronic design automation / Formal methods / Logic in computer science / Constraint programming / Satisfiability Modulo Theories / Solver / Boolean satisfiability problem / Timeout / Transmission Control Protocol / Theoretical computer science / Applied mathematics / NP-complete problems

metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener1 Mathias Soeken1,2 Clemens Werther1

Add to Reading List

Source URL: www.informatik.uni-bremen.de

Language: English - Date: 2014-07-29 13:06:58
192Mathematics / Μ operator / Symbol / Well-formed formula / Boolean satisfiability problem / Model theory / Linear temporal logic / Theoretical computer science / Logic / Metalogic

The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 PDL WITH INTERSECTION AND CONVERSE: SATISFIABILITY AND INFINITE-STATE MODEL CHECKING

Add to Reading List

Source URL: www.informatik.uni-leipzig.de

Language: English - Date: 2008-01-18 08:51:04
193Computer programming / Constraint satisfaction problem / Local consistency / Hidden transformation / Constraint satisfaction / Constraint graph / Boolean satisfiability problem / Hidden variable / Backtracking / Constraint programming / Software engineering / Theoretical computer science

Binary vs. Non-Binary Constraints Fahiem Bacchus Department of Computer Science University of Toronto Toronto, Canada [removed]

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2006-01-21 00:43:15
194Mathematics / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Local consistency / Theoretical computer science / Constraint programming / Applied mathematics

The Satis ability Constraint Gap Ian P. Gent Toby Walsh Department of AI Mechanized Reasoning Group University of Edinburgh IRST, Loc. Pante di Povo, Trento &

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 02:03:59
195NP-complete problems / Logic in computer science / Complexity classes / Boolean algebra / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Outerplanar graph / Planar graph / Theoretical computer science / Graph theory / Computational complexity theory

Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades

Add to Reading List

Source URL: kups.ub.uni-koeln.de

Language: English - Date: 2011-03-28 06:57:24
196Model theory / Functions and mappings / Metalogic / Function / Boolean satisfiability problem / Structure / Sheaf / Field / Linear temporal logic / Mathematics / Abstract algebra / Mathematical logic

Local theory extensions, hierarchical reasoning and applications to verification – Preliminary Report – Viorica Sofronie-Stokkermans, Carsten Ihlemann, Swen Jacobs Max-Planck-Institut f¨ ur Informatik, Campus E 1.4,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2007-11-29 05:23:51
197Deduction / Entailment / Logical consequence / Logical syntax / Metalogic / FO / Interpretation / Boolean satisfiability problem / Logic / Theoretical computer science / Mathematics

Synthese DOI[removed]s11229[removed]Quantified coalition logic Thomas Ågotnes · Wiebe van der Hoek · Michael Wooldridge

Add to Reading List

Source URL: centria.di.fct.unl.pt

Language: English - Date: 2009-10-12 11:30:15
198Logic / Boolean satisfiability problem / Tautology / Conjunctive normal form / Binary decision diagram / Disjunctive normal form / Propositional variable / Truth table / Canonical form / Boolean algebra / Mathematics / Mathematical logic

An Introduction to Binary Decision Diagrams Henrik Reif Andersen x

Add to Reading List

Source URL: fooo.fr

Language: English - Date: 2013-02-15 14:26:20
199NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Conjunctive normal form / Local search / PP / NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics

The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2007-10-29 20:04:40
200Algebraic logic / Electronic engineering / Electronic design automation / Diagrams / Electronic design / Binary decision diagram / Logic synthesis / Boolean satisfiability problem / Boolean function / Boolean algebra / Mathematics / Mathematical logic

A Boolean Paradigm in Multi-Valued Logic Synthesis Alan Mishchenko Department of ECE Portland State University [removed] Abstract

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2002-05-17 15:32:32
UPDATE